A polynomial recognition algorithm for balanced matrices
نویسندگان
چکیده
منابع مشابه
A polynomial recognition algorithm for balanced matrices
A 0,±1 matrix is balanced if it does not contain a square submatrix with two nonzero elements per row and column in which the sum of all entries is 2 modulo 4. Conforti, Cornuéjols and Rao [9], and Conforti, Cornuéjols, Kapoor and Vušković [6], provided a polynomial algorithm to test balancedness of a matrix. In this paper we present a simpler polynomial algorithm, based on techniques introduce...
متن کاملBalanced 0, ±1 Matrices Part II. Recognition Algorithm
In this paper we give a polynomial time recognition algorithm for balanced 0; 1 matrices. This algorithm is based on a decomposition theorem proved in a companion paper.
متن کاملA Polynomial Algorithm for Balanced Clustering via Graph Partitioning
The objective of clustering is to discover natural groups in datasets and to identify geometrical structures which might reside there, without assuming any prior knowledge on the characteristics of the data. The problem can be seen as detecting the inherent separations between groups of a given point set in a metric space governed by a similarity function. The pairwise similarities between all ...
متن کاملA New Multichannel Spectral Factorization Algorithm for Parahermitian Polynomial Matrices
Abstract—A novel multichannel spectral factorization algorithm is illustrated in this paper. This new algorithm is based on an iterative method for polynomial eigenvalue decomposition (PEVD) called the second order sequential best rotation (SBR2) algorithm [1]. By using the SBR2 algorithm, multichannel spectral factorization problems are simply broken down to a set of single channel problems wh...
متن کاملA New Algorithm for General Factorizations of Multivariate Polynomial Matrices
We investigate how to factorize a multivariate polynomial matrix into the product of two matrices. There are two major parts. The first is a factorization theorem, which asserts that a multivariate polynomial matrix whose lower order minors satisfy certain conditions admits a matrix factorization. Our theory is a generalization to the previous results given by Lin et.al [16] and Liu et.al [17]....
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Combinatorial Theory, Series B
سال: 2005
ISSN: 0095-8956
DOI: 10.1016/j.jctb.2005.02.006